Distribution-graph based approach and extended tree growing technique in power-constrained block-test scheduling

نویسندگان

  • Valentin Muresan
  • Xiaojun Wang
  • Valentina Muresan
  • Mircea Vladutiu
چکیده

A distribution-graph based scheduling algorithm is proposed together with an extended tree growing technique to deal with the problem of unequal-length block-test scheduling under power dissipation constraints. The extended tree growing technique is used in combination with the classical scheduling approach in order to improve the test concurrency having assigned power dissipation limits. Its goal is to achieve a balanced test power dissipation by employing a least mean square error firnction. The least mean square error jimction is a distribution-graph based global priority function. Test scheduling examples and experiments highlight in the end the ejficiency of this approach towards a system-level test scheduling algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A comparison of classical scheduling approaches in power-constrained block-test scheduling

Classical scheduling approaches are applied here to overcome the problem of unequal-length block-test scheduling under power dissipation constraints. List schedulinglike approaches are proposed j r s t as greedy algorithms to tackle the fore mentioned problem. Then, distributiongraph based approaches are described in order to achieve balanced test concurrency and test power dissipation. An exte...

متن کامل

A combined tree growing technique for block-test scheduling under power constraints

A tree growing technique is used here together with classical scheduling algorithms in order to improve the test concurrency having assigned power dissipation limits. First of all, the problem of unequal-length block-test scheduling under power dissipation constraints is modeled as a tree growing problem. Then a combination of list and force-directed scheduling algorithms is adapted to tackle i...

متن کامل

Power-Constrained Block-Test List Scheduling

A list scheduling approach is proposed in this paper to overcome the problem of unequal-length block-test scheduling under power dissipation constraints. An extended tree growing technique is also used in combination with the list scheduling algorithm in order to improve the test concurrency having assigned power dissipation limits. Moreover, the algorithm features a power dissipation balancing...

متن کامل

The left edge algorithm in block test scheduling under power constraints

A left-edge algorithm approach is proposed in this paper to deal with the problem of unequal-length block-test scheduling under power dissipation constraints. An extended tree growing technique is also used in combination with the left-edge algorithm in order to improve the test concurrency under power dissipation limits. Test scheduling examples and experiments are discussed highlighting furth...

متن کامل

An Exact Algorithm for the Mode Identity Project Scheduling Problem

In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000